NDND and NBNB systems in quark delocalization color screening model

The $ND$ and $NB$ systems with $I=0$ and $1$, $J^{P}=\frac{1}{2}^{\pm}$, $\frac{3}{2}^{\pm}$, and $\frac{5}{2}^{\pm}$ are investigated within the framework of quark delocalization color screening model. The results show that all the positive parity states are unbound. By coupling to the $ND^{*}$ channel, the state $ND$ with $I=0,~J^{P}=\frac{1}{2}^{-}$ can form a bound state, which can be invoked to explain the observed $\Sigma(2800)$ state. The mass of the $ND^{*}$ with $I=0,~J^{P}=\frac{3}{2}^{-}$ is close to that of the reported $\Lambda_{c}(2940)^{+}$, which indicates that $\Lambda_{c}(2940)^{+}$ can be explained as a $ND^{*}$ molecular state in QDCSM. Besides, the $\Delta D^{*}$ with $I=1,~J^{P}=\frac{5}{2}^{-}$ is also a possible resonance state. The results of the bottom case of $NB$ system are similar to those of the $ND$ system. Searching for these states will be a challenging subject of experiments.Comment: 7 pages, 3 figures. arXiv admin note: text overlap with arXiv:1510.04648, arXiv:1311.473

The chromatic spectrum of 3-uniform bi-hypergraphs

Let $S=\{n_1,n_2,...,n_t\}$ be a finite set of positive integers with $\min(S)\geq 3$ and $t\geq 2$. For any positive integers $s_1,s_2,...,s_t$, we construct a family of 3-uniform bi-hypergraphs ${\cal H}$ with the feasible set $S$ and $r_{n_i}=s_i, i=1,2,...,t$, where each $r_{n_i}$ is the $n_i$th component of the chromatic spectrum of ${\cal H}$. As a result, we solve one open problem for 3-uniform bi-hypergraphs proposed by Bujt\'{a}s and Tuza in 2008. Moreover, we find a family of sub-hypergraphs with the same feasible set and the same chromatic spectrum as it's own. In particular, we obtain a small upper bound on the minimum number of vertices in 3-uniform bi-hypergraphs with any given feasible set